THE PROBABILISTIC NEURAL NET NEURON’S NUMBER CALCULATIONS
نویسندگان
چکیده
منابع مشابه
The EfProb Library for Probabilistic Calculations
EfProb is an abbreviation of Effectus Probability. It is the name of a library for probability calculations in Python. EfProb offers a uniform language for discrete, continuous and quantum probability. For each of these three cases, the basic ingredients of the language are states, predicates, and channels. Probabilities are typically calculated as validities of predicates in states. States can...
متن کاملNew RBF neural network classifier with optimized hidden neurons number
This article presents a noticeable performances improvement of a neural classifier based on an RBF network. Based on the Mahalanobis distance, this new classifier increases relatively the recognition rate while decreasing remarkably the number of hidden layer neurons. We obtain thus a new very general RBF classifier, very simple, not requiring any adjustment parameter, and presenting an excelle...
متن کاملFuzzy-Probabilistic Calculations of Evapotranspiration
Evaluation of evapotranspiration uncertainty is needed for proper decision-making in the fields of water resources and climatic predictions (Buttafuoco et al., 2010; Or and Hanks, 1992; Zhu et al., 2007). However, in spite of the recent progress in soil-water and climatic uncertainty quantification, using stochastic simulations, the estimates of potential (reference) evapotranspiration (Eo) and...
متن کاملOptimizing number of hidden neurons in neural networks
In this paper, a novel and effective criterion based on the estimation of the signal-to-noise-ratio figure (SNRF) is proposed to optimize the number of hidden neurons in neural networks to avoid overfitting in the function approximation. SNRF can quantitatively measure the useful information left unlearned so that overfitting can be automatically detected from the training error only without us...
متن کاملThe Wiener Number of the Hexagonal Net
The Wiener number of a molecular graph, or more generally of a connected graph, is equal to the sum of distances between all pairs of its vertices. A graph formed by a hexagon in the centre, surrounded by n rings of hexagonal cells, is called an n-hexagonal net. It is shown that the Wiener number of an n-hexagonal net equals i( 164n5 30n3 + n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computing
سال: 2014
ISSN: 2312-5381,1727-6209
DOI: 10.47839/ijc.11.2.559